Leveraging range joins for the computation of overlap joins

Abstract Joins are essential and potentially expensive operations in database management systems. When data is associated with time periods, joins commonly include predicates that require pairs of argument tuples to overlap order qualify for the result. Our goal enable built-in systems support such joins. In particular, we present an approach where formulated as unions range joins, which more general purpose compared i.e., useful their own right, supported well by B+-trees. The sufficiently flexible it also supports additional equality predicates, open, closed, half-open periods over discrete continuous domains, thus offering both generality simplicity, important a system setting. We provide stand-alone solution performs on par state-of-the-art DBMS embedded able exploit standard indexing clearly outperforms existing solutions depend specialized techniques. offer analytical empirical evaluations proposals. study includes comparisons pertinent proposals offers detailed insight into performance characteristics